Quantum strongly secure ramp secret sharing

نویسندگان

  • Paul Zhang
  • Ryutaroh Matsumoto
چکیده

Quantum secret sharing is a scheme for encoding a quantum state (the secret) into multiple shares and distributing them among several participants. If a sufficient number of shares are put together, then the secret can be fully reconstructed. If an insufficient number of shares are put together however, no information about the secret can be revealed. In quantum ramp secret sharing, partial information about the secret is allowed to leak to a set of participants, called an unqualified set, that cannot fully reconstruct the secret. By allowing this, the size of a share can be drastically reduced. This paper introduces a quantum analog of classical strong security in ramp secret sharing schemes. While the ramp secret sharing scheme still leaks partial information about the secret to unqualified sets of participants, the strong security condition ensures that qudits with critical information can no longer be leaked.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strongly Secure Quantum Ramp Secret Sharing Constructed from Algebraic Curves over Finite Fields

The first construction of strongly secure quantum ramp secret sharing by Zhang and Matsumoto had an undesirable feature that the dimension of quantum shares must be larger than the number of shares. By using algebraic curves over finite fields, we propose a new construction in which the number of shares can become arbitrarily large for fixed dimension of shares.

متن کامل

Ogata : on the Practical Secret Sharing Scheme

In this paper, we attempt to construct practical secret sharing schemes, which scheme has smaller share size and can detect cheating with high probability. We de ne two secure ramp schemes, secure ramp scheme and strongly secure ramp scheme. Then, we propose two constructions of secure ramp scheme. These schemes both have small share size and the cheating can be detected with high probability. ...

متن کامل

Strongly Secure Linear Network Coding

In a network with capacity h for multicast, information Xh = (X1, X2, · · · , Xh) can be transmitted from a source node to sink nodes without error by a linear network code. Furthermore, secret information S r = (S 1, S 2, · · · , S r) can be transmitted securely against wiretappers by k-secure network coding for k ≤ h−r. In this case, no information of the secret leaks out even if an adversary...

متن کامل

Strong Security of the Strongly Multiplicative Ramp Secret Sharing Based on Algebraic Curves

Secret sharing [1] is a well-established topic in the information security [2]. It attracts renewed interest after Cramer et al. [3] revealed that any linear secret sharing with the so-called multiplicative (or strongly multiplicative) property can be used for the secure multiparty computation. Later, the multiplicative properties were generalized to the ramp secret sharing [4], [5]. In [5, Sec...

متن کامل

Strongly Secure Quantum Ramp Secret Sharing Constructed from Algebraic Curves over Finite Fields (full version arXiv:1410.5126)

Secret sharing (SS) scheme encodes a secret into multiple shares being distributed to participants, so that only qualified sets of shares can reconstruct the secret perfectly [13]. The secret and shares are traditionally classical information [13], but now quantum secret and quantum shares can also be used [3, 4, 11]. In perfect SS, if a set of shares is not qualified, that is, it cannot recons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Quantum Information Processing

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2015